Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
نویسندگان
چکیده
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes Boolean matrix B, with the number of factors as small as possible. This paper is a continuation of our previous paper where we proved that formal concepts of I are optimal factors for Boolean factor analysis. In particular, we concentrate on the implications of the proof. Namely, on the fact that finding factors can be reduced to the set covering problem for which there exist efficient approximation algorithms. In this paper, we present the algorithm for finding factors which results this way and present several experiments on factorizing Boolean matrices.
منابع مشابه
Discovery of optimal factors in binary data via a novel method of matrix decomposition
a r t i c l e i n f o a b s t r a c t Keywords: Binary matrix decomposition Factor analysis Binary data Formal concept analysis Concept lattice We present a novel method of decomposition of an n × m binary matrix I into a Boolean product A • B of an n × k binary matrix A and a k × m binary matrix B with k as small as possible. Attempts to solve this problem are known from Boolean factor analysi...
متن کاملOn Boolean factor analysis with formal concepts as factors
The paper presents results on factorization of binary matrices using formal concepts generated from the input matrix. We prove several results, e.g. that each matrix is conceptfactorizable, that concept-factorizability is the best way to factorize binary matrices, describe sets of good factors, mandatory factors, etc. In addition to that, we outline an algorithm for finding factors. The results...
متن کاملTriadic Factor Analysis
This article is an extension of work which suggests using formal concepts as optimal factors of Factor Analysis. They discussed a method for decomposing a p × q binary matrix W into the Boolean matrix product P ◦ Q of a p × n binary matrix P and a n × q binary matrix Q with n as small as possible. We have generalised this factorization problem to the triadic case, looking for a decomposition of...
متن کاملUsing Blind Search and Formal Concepts for Binary Factor Analysis
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binary data too, the BFA can be used to analyse such collections. Unfortunately, exact solving of BFA is not easy. This article shows two BFA methods based on exact computing, boolean algebra and the theory of formal conce...
متن کاملFormal-comparative analysis of the spatial organization of student residence halls based on their spatial threshold patterns
Functional quality of the student residence halls has a great deal of importance due to their collective nature and the fact that they are considered as housing units, identifying and defining the role of intermediary spaces on the spatial organization and and spatial consociation of student residence halls which is a compound system of masses and spatial borderlines can bring order to its syst...
متن کامل